Search Results

Documents authored by Hoffmann, Chris

Found 3 Possible Name Variants:

Hoffmann, Christoph M.

Document
DOI: 10.4230/DagSemProc.06021.1
06021 Abstracts Collection – Reliable Implementation of Real Number Algorithms: Theory and Practice

Authors: Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, and Nathalie Revol

Published in: Dagstuhl Seminar Proceedings, Volume 6021, Reliable Implementation of Real Number Algorithms: Theory and Practice (2006)

Abstract
From 08.01.06 to 13.01.06, the Dagstuhl Seminar 06021 ``Reliable Implementation of Real Number Algorithms: Theory and Practice'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, and Nathalie Revol. 06021 Abstracts Collection – Reliable Implementation of Real Number Algorithms: Theory and Practice. In Reliable Implementation of Real Number Algorithms: Theory and Practice. Dagstuhl Seminar Proceedings, Volume 6021, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{hertling_et_al:DagSemProc.06021.1,
  author =	{Hertling, Peter and Hoffmann, Christoph M. and Luther, Wolfram and Revol, Nathalie},
  title =	{{06021 Abstracts Collection – Reliable Implementation of Real Number Algorithms: Theory and Practice}},
  booktitle =	{Reliable Implementation of Real Number Algorithms: Theory and Practice},
  pages =	{1--18},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6021},
  editor =	{Peter Hertling and Christoph M. Hoffmann and Wolfram Luther and Nathalie Revol},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06021.1},
  URN =		{urn:nbn:de:0030-drops-7491},
  doi =		{10.4230/DagSemProc.06021.1},
  annote =	{Keywords: Real number algorithms, reliable implementation}
}
Document
DOI: 10.4230/DagSemProc.06021.2
06021 Summary – Reliable Implementation of Real Number Algorithms: Theory and Practice

Authors: Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, and Nathalie Revol

Published in: Dagstuhl Seminar Proceedings, Volume 6021, Reliable Implementation of Real Number Algorithms: Theory and Practice (2006)

Abstract
The seminar brought together researchers from many different disciplines concerned with the reliable implementation of real number algorithms either from a theoretical or from a practical point of view. In this summary we describe the topics, the goals, and the contributions of the seminar.
Cite as

Peter Hertling, Christoph M. Hoffmann, Wolfram Luther, and Nathalie Revol. 06021 Summary – Reliable Implementation of Real Number Algorithms: Theory and Practice. In Reliable Implementation of Real Number Algorithms: Theory and Practice. Dagstuhl Seminar Proceedings, Volume 6021, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{hertling_et_al:DagSemProc.06021.2,
  author =	{Hertling, Peter and Hoffmann, Christoph M. and Luther, Wolfram and Revol, Nathalie},
  title =	{{06021 Summary – Reliable Implementation of Real Number Algorithms: Theory and Practice}},
  booktitle =	{Reliable Implementation of Real Number Algorithms: Theory and Practice},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6021},
  editor =	{Peter Hertling and Christoph M. Hoffmann and Wolfram Luther and Nathalie Revol},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06021.2},
  URN =		{urn:nbn:de:0030-drops-7117},
  doi =		{10.4230/DagSemProc.06021.2},
  annote =	{Keywords: Real number computability, real number algorithms, reliable computing, algorithms with result verification, interval arithmetic, geometric computing, robustness, solid modeling}
}

Hoffmann, Chris

Document
DOI: 10.4230/DagSemRep.227
CAD-Tools and Methods for Systems Development (Dagstuhl Seminar 98461)

Authors: Pere Brunet, Chris Hoffmann, and Dieter Roller

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Pere Brunet, Chris Hoffmann, and Dieter Roller. CAD-Tools and Methods for Systems Development (Dagstuhl Seminar 98461). Dagstuhl Seminar Report 227, pp. 1-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2000)

Copy BibTex To Clipboard

@TechReport{brunet_et_al:DagSemRep.227,
  author =	{Brunet, Pere and Hoffmann, Chris and Roller, Dieter},
  title =	{{CAD-Tools and Methods for Systems Development (Dagstuhl Seminar 98461)}},
  pages =	{1--37},
  ISSN =	{1619-0203},
  year =	{2000},
  type = 	{Dagstuhl Seminar Report},
  number =	{227},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.227},
  URN =		{urn:nbn:de:0030-drops-151136},
  doi =		{10.4230/DagSemRep.227},
}

Hoffmann, Christian

Document
DOI: 10.4230/LIPIcs.STACS.2008.1337
On the Complexity of the Interlace Polynomial

Authors: Markus Bläser and Christian Hoffmann

Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)

Abstract
We consider the two-variable interlace polynomial introduced by Arratia, Bollob`as and Sorkin (2004). We develop two graph transformations which allow us to derive point-to-point reductions for the interlace polynomial. Exploiting these reductions we obtain new results concerning the computational complexity of evaluating the interlace polynomial at a fixed point. Regarding exact evaluation, we prove that the interlace polynomial is #P-hard to evaluate at every point of the plane, except at one line, where it is trivially polynomial time computable, and four lines and two points, where the complexity mostly is still open. This solves a problem posed by Arratia, Bollob`as and Sorkin (2004). In particular, we observe that three specializations of the two-variable interlace polynomial, the vertex-nullity interlace polynomial, the vertex-rank interlace polynomial and the independent set polynomial, are almost everywhere #P-hard to evaluate, too. For the independent set polynomial, our reductions allow us to prove that it is even hard to approximate at every point except at $-1$ and~$0$.
Cite as

Markus Bläser and Christian Hoffmann. On the Complexity of the Interlace Polynomial. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 97-108, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{blaser_et_al:LIPIcs.STACS.2008.1337,
  author =	{Bl\"{a}ser, Markus and Hoffmann, Christian},
  title =	{{On the Complexity of the Interlace Polynomial}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{97--108},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Albers, Susanne and Weil, Pascal},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1337},
  URN =		{urn:nbn:de:0030-drops-13378},
  doi =		{10.4230/LIPIcs.STACS.2008.1337},
  annote =	{Keywords: Computational complexity, approximation, interlace polynomial, independent set polynomial, graph transformation}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact